1481A - Space Navigation - CodeForces Solution


greedy strings *800

Please click on ads to support us..

Python Code:

for _ in range(int(input())):
    x,y = map(int, input().split())
    z = input()
    countR = z.count('R')
    countL = z.count('L')
    countU = z.count('U')
    countD = z.count('D')
    if x > 0:
        if y > 0:
            if countR >= x and countU >= y:
                print('YES')
            else:
                print('NO')
        else:
            if countR >= x and countD >= abs(y):
                print('YES')
            else:
                print('NO')
    else:
        if y > 0:
            if countL >= abs(x) and countU >= y:
                print('YES')
            else:
                print('NO')
        else:
            if countL >= abs(x) and countD >= abs(y):
                print('YES')
            else:
                print('NO')


Comments

Submit
0 Comments
More Questions

376A - Lever
1305A - Kuroni and the Gifts
1609A - Divide and Multiply
149B - Martian Clock
205A - Little Elephant and Rozdil
1609B - William the Vigilant
978B - File Name
1426B - Symmetric Matrix
732B - Cormen --- The Best Friend Of a Man
1369A - FashionabLee
1474B - Different Divisors
1632B - Roof Construction
388A - Fox and Box Accumulation
451A - Game With Sticks
768A - Oath of the Night's Watch
156C - Cipher
545D - Queue
459B - Pashmak and Flowers
1538A - Stone Game
1454C - Sequence Transformation
165B - Burning Midnight Oil
17A - Noldbach problem
1350A - Orac and Factors
1373A - Donut Shops
26A - Almost Prime
1656E - Equal Tree Sums
1656B - Subtract Operation
1656A - Good Pairs
1367A - Short Substrings
87A - Trains